k-node-disjoint hop-constrained survivable networks: polyhedral analysis and branch and cut
نویسندگان
چکیده
منابع مشابه
Two node-disjoint hop-constrained survivable network design and polyhedra
Given a weighted undirected graphGwith a set of pairs of terminals {si, ti}, i = 1, ..., d, and an integer L ≥ 2, the two node-disjoint hop-constrained survivable network design problem (TNHNDP) is to find a minimum weight subgraph of G such that between every si and ti there exist at least two node-disjoint paths of length at most L. This problem has applications to the design of survivable te...
متن کاملTraffic Engineering over Hop-Constrained Node Survivable Networks
Traffic engineering on a given network is the task of determining how traffic commodities must be routed in order to maintain an optimal performance. In this work, we aim to optimize routing by minimizing the number of routing hops, which has a positive impact on the delay provided by the network to traffic commodities, while ensuring some desired survivability guarantees. In [1], we have consi...
متن کاملThe survivable k-node-connected network design problem: Valid inequalities and Branch-and-Cut
In this paper we consider the k-node-connected subgraph problem. We propose an integer linear programming formulation for the problem and investigate the associated polytope. We introduce further classes of valid inequalities and discuss their facial aspect. We also devise separation routines, investigate the structural properties of the linear relaxation and discuss some reduction operations t...
متن کاملExtended Node-Arc Formulation for the K-Edge-Disjoint Hop-Constrained Network Design Problem
This paper considers the K-edge-disjoint hop-constrained Network Design Problem (HCNDP) which consists in finding a minimum cost subgraph such that there exists at least K-edge-disjoint paths between origins and destinations of demands, and such that the length of these paths is at most equal to a given parameter L. This problem was considered in the past using only design variables. Here, we c...
متن کاملDesigning capacitated survivable networks: Polyhedral analysis and algorithms
Designing capacitated survivable networks: Polyhedral analysis and algorithms by Deepak Rajan Doctor of Philosophy in Engineering-Industrial Engineering and Operations Research University of California, Berkeley Professor Alper Atamtürk, Chair In this dissertation, we develop new methodologies and efficient algorithms to solve the capacitated survivable network design problem. Given the graph a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Telecommunications
سال: 2018
ISSN: 0003-4347,1958-9395
DOI: 10.1007/s12243-017-0622-3